Perturbations for Delaunay and weighted Delaunay 3D triangulations
نویسندگان
چکیده
The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron exists in the defined triangulation. The perturbation scheme is easy to code; It is implemented in cgal, and guarantees that both vertex insertion and vertex removal are fully robust.
منابع مشابه
The Stability of Delaunay Triangulations
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We quantify the magnitude of the perturbations under which the Delaunay triangulation r...
متن کاملA Variational Principle for Weighted Delaunay Triangulations and Hyperideal Polyhedra
We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with one vertex on and the remaining vertices beyond the infinite boundary of hype...
متن کاملStability of Delaunay-type structures for manifolds
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We then show that, for any sufficiently regular submanifold of Euclidean space, and app...
متن کاملGeneral-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of user-specified domains, they have “nicely shaped” triangles that optimize several criteria, and they are easy to construct and update. The present work generalizes constrained Delaunay triangulations (CDTs) to higher dimensions, a...
متن کاملThree-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach
In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In addition, we report a robust implementation process for constructing 3D constrained triangulations from initial unconstrained triangulations, based on a minimalist approach, in which we minimize the use of geometrical operations such as intersections. This is achieved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 44 شماره
صفحات -
تاریخ انتشار 2011